Dimensional dominance and adult shift learning
نویسندگان
چکیده
منابع مشابه
Distinctive features of adult ocular dominance plasticity.
Sensory experience profoundly shapes neural circuitry of juvenile brain. Although the visual cortex of adult rodents retains a capacity for plasticity in response to monocular visual deprivation, the nature of this plasticity and the neural circuit changes that accompany it remain enigmatic. Here, we investigate differences between adult and juvenile ocular dominance plasticity using Fourier op...
متن کاملAdaptive Learning and Iterated Weak Dominance
This article addresses the idea that rational players should not play iteratively weakly dominated strategies by showing that when a particular type of adaptive learning process converges, then players must have learned to play strategy profiles equivalent to those that survive iterated nice weak dominance and, for certain games, equivalent to those that survive iterated weak dominance. For gam...
متن کاملHigh-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملinvestigating the effect of motivation and attitude towards learning english, learning style preferences and gender on iranian efl learners proficiency
تحقیق حاضر به منظور بررسی تاثیر انگیزه و نگرش نسبت به یادگیری زبان انگلیسی، ترجیحات سبک یادگیری و جنسیت بر بسندگی فراگیران ایرانی زبان انگلیسی انجام شد. برای این منظور، 154 فراگیر ایرانی زبان انگلیسی در این تحقیق شرکت کردند. سه ابزار جمع آوری داده ها شامل آزمون تعیین سطح بسندگی زبان انگلیسی آکسفورد، پرسشنامه ترجیحات سبک یادگیری براچ و پرسشنامه انگیزه و نگرش نسبت به یادگیری زبان انگلیسی به م...
Dominance Product and High-Dimensional Closest Pair under L_infty
Given a set S of n points in R, the Closest Pair problem is to find a pair of distinct points in S at minimum distance. When d is constant, there are efficient algorithms that solve this problem, and fast approximate solutions for general d. However, obtaining an exact solution in very high dimensions seems to be much less understood. We consider the high-dimensional L∞ Closest Pair problem, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Psychonomic Society
سال: 1977
ISSN: 0090-5054
DOI: 10.3758/bf03337009